Overview of Algorithms for Graph Drawing
نویسنده
چکیده
This paper presents an overview of many possible types of graph visualization, and also detailed descriptions of the most popular algorithms. Its primal goal is, to help a user, with some relational data on his hands and a need to visualizing it, with the choice of what to use, and what is out there that can be used. However, it can be also viewed as historical overview of graph drawing algorithms, and its evolution.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملArea-Efficient Static and Incremental Graph Drawings
In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an (m ? 1) (m 2 + 1)-grid for graphs with n nodes and m edges. We present algorithms for two scenarios. In the static scenario, the graph is given completely in advance. We produc...
متن کاملApplications of Parameterized st-Orientations in Graph Drawing Algorithms
Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algo...
متن کاملAlgorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
We present two algorithms for orthogonal graph drawing in three dimensional space. For a graph with n vertices of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.63n and has at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing...
متن کاملAgd{library: a Library of Algorithms for Graph Drawing 1
A graph drawing algorithm produces a layout of a graph in two-or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria diier from one application area to another, it is unlikely that a deenition of the \optimal drawing" of a graph in a strict mathematical sense exists. A large number of graph drawing algorithms taking different aesthetic criteria i...
متن کامل